Processing math: 100%

ZZZ (working) / Logic (Bibtex)

P223: Enumeration of MS query of a word
Input:
Output:
Complexity:
Comment:
Reference:
[Courcelle2009c] (Bibtex)
P195: Enumeration of all answers to first-order queries
Input:
A database DC and query ϕ.
Output:
All answers on D.
Complexity:
O(1) delay after linear preprocessing time.
Comment:
Reference:
[Kazana2013b] (Bibtex)
P196: Enumeration of all Monadic Second Order queries on a tree
Input:
Output:
Complexity:
O(1) delay after linear preprocessing time.
Comment:
Reference:
[Kazana2013d] (Bibtex)